منابع مشابه
Decidable Subsets of CCS
Process algebra is a very interesting framework for describing and analyzing concurrent systems. Therefore CCS is used very often and considered pretty important. But it is undecidable if two CCS agents are bisimilar. Luckily Christensen, Hirshfeld and Moller showed 1994 in their paper “Decidable Subsets of CCS” that bisimulation for CCS without communication or without restriction and relabell...
متن کاملSeparability of rational subsets by recognizable subsets is decidable in A∗ × N
Given a direct product of monoids M = A∗ ×N where A is finite and N is the additive monoid of nonnegative integers, the following problem is recursively decidable: given two rational subsests of M , does there exist a recognizable subset which includes one of the subsets and excludes the other.
متن کاملRethinking CCS Developing quantitative tools for analyzing investments in CCS
Lack of climate policy and CO2 markets along with a global economic slowdown suggest that we need to rethink our approach to demonstrating CCS at a commercial scale. Austerity measures make it likely that public funding will be tight in coming years, and there is a striking need to ensure that limited funds are spent optimally. Quantitative tools exist for aiding decision making under uncertain...
متن کاملCCS with Priority
It has long been recognised that standard process algebra has difficulty dealing with actions of different priority, such as for instance an interrupt action of high priority. Various solutions have been proposed. We introduce a new approach, involving the addition of “priority guards” to Milner’s process calculus CCS. In our approach, priority is unstratified, meaning that actions are not assi...
متن کاملDecidable Theories
In this lecture we work exclusively with first-order logic with equality. Fix a signature σ. A theory T is a set of sentences (closed formulas) that is closed under semantic entailment, i.e., if T |= F then F ∈ T . Given a σ-structure A it is clear that the set of sentences that hold in A is a theory. We denote this theory by Th(A) and call it the theory of A. We say that a theory is complete i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Computer Journal
سال: 1994
ISSN: 0010-4620,1460-2067
DOI: 10.1093/comjnl/37.4.233